To meet, to gossip

نویسنده

  • The Spider
چکیده

The web has transformed the way scientists search for information, but its potential as a tool for scientific collaboration is still largely unrealized. The BIONET newsgroups prove that even 1960s technology can support some kind of intelligent discussion, and IRC (Internet Relay Chat) shows that large-scale, realtime communication is also possible across the net, but for serious use and constructive collaboration, something more is needed — an infrastructure. Biology has a head start in this extremely active area of research, thanks in large part to the efforts of Gustavo Glusman, creator of BioMOO. BioMOO’s strange name is a reflection of its strange origins. “OO” stands for object-oriented, while “M” stands for MUD, or Multi-User Dungeon. Although Glusman prefers to call it a ‘Multi-User Dimension’, the roots of BioMOO are firmly in the role-playing game systems developed in the mid-eighties which kept students up into the early hours, destroying dragons and casting spells on gremlins. This same technology has been brilliantly adapted by Glusman to provide a collaborative environment for biologists. In BioMOO, scientists can wander around the system’s various ‘rooms’, holding private meetings, giving public seminars, or just chatting, conversing with other users by typing in realtime. During BioMOO’s early development, it was predominantly used by structural biologists and bioinformaticists — the same technologically literate group of biologists which was first to exploit the internet. These users were not intimidated by the command-line interface which at that time was the only way to access BioMOO. Indeed, they revelled in the powerful programming language built into BioMOO, which allows customised ‘objects’ and ‘robots’ to be created within the BioMOO environment. But this kind of interface is not adequate for the more general user. For BioMOO to really take off in the wider biological community, the alltext interface needs to be supplanted by a more intuitive, visual approach. BioMOO has already progressed a long way in this direction. The best way to use BioMOO right now is to have both a terminal window and a web window open and pointing at the BioMOO site. Each window reflects the changes in the other, so if you are in a seminar room and type a command on your terminal to display your second slide, your web browser and those of all the other users watching your presentation will be updated to show the ‘slide’. Conversely, you can wander up and down a virtual poster session using the web window to move from poster to poster, and the terminal window will follow your movements so that when you get to something you find particularly interesting, you can engage in real-time text chat with the poster’s author. Very soon it should be possible to make full use of BioMOO through the web alone. As web browsers become more and more adept at handling 3D graphics, and real-time audio and visual communication, BioMOO will increasingly be an effective alternative to international travel, whether for meetings, collaboration on books or papers, or even for evaluation of job and fellowship applications. All of which is good news for graduate students who currently despair of tracking down their peripatetic advisers. As well as allowing researchers to hold on-line meetings and conferences, BioMOO has already proved its value as an educational tool. In 1995, Peter Murray-Rust and Alan Mills organized a course, run from Birkbeck College in London, entitled ‘Principals of Protein Structure’. The course was taught exclusively via the internet, making extensive use of BioMOO, and the experiment was so successful that the 1996 course has academic accreditation and participants are to receive an Advanced Certificate from London University. Finally, amid all this lofty discussion of collaborative environments, it would never do to ignore that most vital stimulus to human communication — the need to gossip. Martin Leach’s ‘Biotechnology Rumour Mill’ fills just this gap. Admittedly it has its share of rather dull corporate announcements, but it also contains a sprinkling of genuinely interesting tittle-tattle. Contributions are welcome — the more scandalous, the better. If necessary, they can even be submitted anonymously.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

Gossip Latin Square and The Meet-All Gossipers Problem

Given a network of n = 2 gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper communicates (gossips) only once a day, with one other gossiper, (2) in every (n−1) consecutive days, each gossiper meets all other gossipers, and (3) every gossip, initiated by any gossiper, will reach all gossipers within k = log(n) days. In this paper we stu...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract)

The communication power of the one-way and two-way edge-disjoint path modes for broadcast and gossip is investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). The main results achieved are the following: 1. For each connected graph G n of n nodes, the complexity of broadcast in G n , B min (G n), satisses dlog 2 ne B min (G n) dlog 2 ...

متن کامل

DisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...

متن کامل

Randomized Gossip Algorithm with Unreliable Communication

In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are established with communication in each direction succeeding with a time-varying probability. It is shown that two particularly interesting cases arise when these comm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Current Biology

دوره 6  شماره 

صفحات  -

تاریخ انتشار 1996